QRT FIFO automata, breadth-first grammars and their relations
نویسندگان
چکیده
منابع مشابه
QRT FIFO Automata, Breath-First Grammars and Their Relations
Cherubini, A., C. Citrini, S.C. Reghizzi, and D. Mandrioli, QRT FIFO automata, breadth-first grammars and their relations, Theoretical Computer Science 85 (1991) 171-203. Some classes of queue automata (deterministic and nondeterministic), i.e. machines equipped with one or more FIFO tapes, and corresponding languages are considered. For quasi-real-time (QRT) deterministic machines, recognition...
متن کاملturkish-israeli relations and their implication on iranian national security
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
15 صفحه اولSinc.doc 921023 Local Grammars and Their Representation by Finite Automata
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors and figurative meanings, etc.) one often encounters sets of similar forms that cannot be related by formal rules of either type: phrase structure or transformational. We present examples of such situations and we show how the formalism of finite automata can be used to represent them in a natural...
متن کاملLearning Automata and Grammars
The problem of learning or inferring automata and grammars has been studied for decades and has connections to many disciplines, including bioinformatics, computational linguistics and pattern recognition. In this paper we present a short survey of basic models and techniques related to the grammatical inference and try to outline some new promising approaches which we expect to bring new light...
متن کاملUnsafe Grammars and Panic Automata
We show that the problem of checking if an infinite tree generated by a higher-order grammar of level 2 (hyperalgebraic) satisfies a given μ-calculus formula (or, equivalently, if it is accepted by an alternating parity automaton) is decidable, actually 2-Exptime-complete. Consequently, the monadic second-order theory of any hyperalgebraic tree is decidable, so that the safety restriction can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90053-5